An Introduction to Fuzzy State Automata
نویسنده
چکیده
This paper introduces Fuzzy State Automata for control applications. They are derived from the integration of traditional nite state automata and neuro-fuzzy systems, where a nite state automaton tracks the state of the plant under control and modiies the characteristic of the neuro-fuzzy system accordingly. The main diierence with respect to existing systems is that the states of the automata are identiied by fuzzy, instead of crisp variables, therefore state transitions and the corresponding controller characteristic are smoother and easier to train or tune.
منابع مشابه
NEW DIRECTION IN FUZZY TREE AUTOMATA
In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...
متن کاملMyhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملGENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
The present paper has been an attempt to investigate the general fuzzy automata on the basis of complete residuated lattice-valued ($L$-GFAs). The study has been chiefly inspired from the work by Mockor cite{15, 16, 17}. Regarding this, the categorical issue of $L$-GFAs has been studied in more details. The main issues addressed in this research include: (1) investigating the relationship betwe...
متن کامل